Manufacturing 4.0 Operations Scheduling with AGV Battery Management Constraints
نویسندگان
چکیده
منابع مشابه
Techniques for cash management in scheduling manufacturing operations
The objective in traditional scheduling is usually time based. Minimizing the makespan, total flow times, total tardi costs, etc. are instances of these objectives. In manufacturing, processing each job entails a cost paying and price receiving. Thus, the objective should include some notion of managing the flow of cash. We have defined two new objectives: maximization of average and minimum av...
متن کاملTimeline-Based Space Operations Scheduling with External Constraints
We describe a timeline-based scheduling algorithm developed for mission operations of the EO-1 earth observing satellite. We first describe the range of operational constraints for operations focusing on maneuver and thermal constraints that cannot be modeled in typical planner/schedulers. We then describe a greedy heuristic scheduling algorithm and compare its performance to both the prior sch...
متن کاملLearning Operations Management With Web-based Manufacturing Simulation
Traditional learning methods in operations management are not ideally suited for externalising knowledge. In this paper, an iterative, gaming-like learning approach for practicing OM issues by using discrete event simulation model is proposed. The approach is utilising an existing learning environment called Delfoi Planner EDU. Its web-based architecture supports distance learning that is an as...
متن کاملScheduling Semiconductor Manufacturing Operations: Problems, Solution Techniques, and Future Challenges
In this paper, we discuss scheduling problems in semiconductor manufacturing. Starting from describing the manufacturing process, we identify typical scheduling problems that can be found in semiconductor manufacturing systems. We describe batch scheduling problems, job shop scheduling problems, scheduling problems with secondary resources, multiple orders per job scheduling problems, and sched...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energies
سال: 2020
ISSN: 1996-1073
DOI: 10.3390/en13184948